Intensionality in Mathematics

نویسنده

  • Jaroslav Peregrin
چکیده

Do mathematical expressions have intensions, or merely extensions? If we accept the standard account of intensions based on possible worlds, it would seem that the latter is the case – there is no room for nontrivial intensions in the case of non-empirical expressions. However, some vexing mathematical problems, notably Gödel’s Second Incompleteness Theorem, seem to presuppose an intensional construal of some mathematical expressions. Hence, can we make room for intensions in mathematics? In this paper we argue that this is possible, provided we give up the standard approach to intensionality based on possible worlds. 1 Which sentence of PA says that PA is inconsis-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intensionality and the Gdel Theorems

Philosophers of language have drawn on metamathematical results in varied ways. Extensionalist philosophers have been particularly impressed with two, not unrelated, facts: the existence, due to Frege/Tarski, of a certain sort of semantics, and the seeming absence of intensional contexts from mathematical discourse. The philosophical import of these facts is at best murky. Extensionalists will ...

متن کامل

Factives and Intensionality

Notion of normal intensionality and of intensionality preserving negation are introduced. Both these notions apply to intensional sentential operators. When applied to factive operators they allows us to understand the way these operators give rise to presuppositions and their duals, assertions. They allow us also to distinguish semantically emotive factives from non-emotive ones.

متن کامل

A Higher-order Fine-grained Logic for Intensional Semantics

This paper describes a higher-order logic with fine-grained intensionality (FIL). Unlike traditional Montogovian type theory, intensionality is treated as basic, rather than derived through possible worlds. This allows for fine-grained intensionality without impossible worlds. Possible worlds and modalities are defined algebraically. The proof theory for FIL is given as a set of tableau rules, ...

متن کامل

Expressiveness via Intensionality and Concurrency

Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the λ-calculus. However, recent work shows that there are more expressive intensional calculi such as S F-calculus. Traditionally process calculi capture computation by encoding the λ-calculus, ...

متن کامل

An Operational Approach to Fine-Grained Intensionality

Classical intensional semantic frameworks, like Montague’s Intensional Logic (IL), identify intensional identity with logical equivalence. This criterion of co-intensionality is excessively coarse-grained, and it gives rise to several well known difficulties. Theories of fine-grained intensionality have been been proposed to avoid this problem. Several of these provide a formal solution to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017